Search results for "Critical graph"

showing 2 items of 2 documents

An efficient algorithm for stopping on a sink in a directed graph

2013

Abstract Vertices of an unknown directed graph of order n are revealed one by one in some random permutation. At each point, we know the subgraph induced by the revealed vertices. Our goal is to stop on a sink, a vertex with no out-neighbors. We show that if a sink exists this can be achieved with probability Θ ( 1 / n ) , which is best possible.

Factor-critical graphDiscrete mathematicsApplied MathematicsNeighbourhood (graph theory)Directed graphManagement Science and Operations ResearchBiconnected graphIndustrial and Manufacturing EngineeringHypercube graphCombinatoricsWheel graphPath graphGraph factorizationSoftwareMathematicsofComputing_DISCRETEMATHEMATICSMathematicsOperations Research Letters
researchProduct

Strong chromatic index of products of graphs

2007

Graphs and Algorithms

General Computer ScienceCritical graphKronecker product[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]strong productinduced matchingTheoretical Computer ScienceCombinatoricssymbols.namesakeComputer Science::Discrete MathematicsCartesian productDiscrete Mathematics and CombinatoricsChromatic scaleMathematicsDiscrete mathematicsKronecker productMathematics::Combinatoricslcsh:Mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productlcsh:QA1-939Graph[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringMSC 05C15strong product.symbolsHypercubeStrong edge colouringMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct